The Full Periodicity Kernel for a Class of Graph Maps

نویسنده

  • J. A. RODRIGUEZ
چکیده

Let X be a graph and let C be a class of X-maps (that is, of continuous maps from X into itself). A map f ∈ C is said to have full periodicity if Per (f) = N (here, Per (f) denotes the set of periods of all periodic points of f and N the set of positive integers). The set K ⊆ N is a full periodicity kernel of C if it satisfies the following two conditions: (i) If f ∈ C and K ⊆ Per (f) then f has full periodicity and (ii) if S ⊂ N is a set such that, for every f ∈ C, S ⊆ Per (f) implies Per (f) = N, then K ⊆ S. In this paper we show the existence and characterize the full periodicity kernel of the class of continuous maps from a graph with zero Euler characteristic to itself having all branching points fixed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

اثر تناوب بهره‌برداری سقز بر زادآوری طبیعی درختان بنه (مطالعه موردی: جنگل‌های بنه استان کردستان، سنندج)

In order to evaluate the impacts of oleo-gum resin extraction periodicity on natural regeneration of wild pistachio (Pistacia atlantica subsp. kurdica), three different forest areas in Kurdistan province, west of Iran, were selected based on difference extraction periodicities (regular periodicity, irregular periodicity and without periodicity). Then homogenous unit maps in GIS produced, and on...

متن کامل

An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step

An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...

متن کامل

Entropy Estimate for Maps on Forests

A 1993 result of J. Llibre, and M. Misiurewicz, (Theorem A [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. Also a 1980 result of L.S. Block, J. Guckenheimer, M. Misiurewicz and L.S. Young (Lemma 1.5 [3]) states that if G is an A-graph of f then h(G) ? h( f ). In this pap...

متن کامل

A Class of Limit Algebras Associated with Directed Graphs

Every directed graph defines a Hilbert space and a family of weighted shifts that act on the space. We identify a natural notion of periodicity for such shifts and study their C∗algebras. We prove the algebras generated by all shifts of a fixed period are of Cuntz-Krieger and Toeplitz-Cuntz-Krieger type. The limit C∗-algebras determined by an increasing sequence of positive integers, each divid...

متن کامل

MULTI CLASS BRAIN TUMOR CLASSIFICATION OF MRI IMAGES USING HYBRID STRUCTURE DESCRIPTOR AND FUZZY LOGIC BASED RBF KERNEL SVM

Medical Image segmentation is to partition the image into a set of regions that are visually obvious and consistent with respect to some properties such as gray level, texture or color. Brain tumor classification is an imperative and difficult task in cancer radiotherapy. The objective of this research is to examine the use of pattern classification methods for distinguishing different types of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999